On Thompson’s conjecture for finite simple groups
نویسندگان
چکیده
منابع مشابه
On the product decomposition conjecture for finite simple groups
We prove that if G is a finite simple group of Lie type and S a subset of G of size at least two then G is a product of at most c log |G|/ log |S| conjugates of S, where c depends only on the Lie rank of G. This confirms a conjecture of Liebeck, Nikolov and Shalev in the case of families of simple groups of bounded rank. We also obtain various related results about products of conjugates of a s...
متن کاملFinite Permutation Groups and Finite Simple Groups
In the past two decades, there have been far-reaching developments in the problem of determining all finite non-abelian simple groups—so much so, that many people now believe that the solution to the problem is imminent. And now, as I correct these proofs in October 1980, the solution has just been announced. Of course, the solution will have a considerable effect on many related areas, both wi...
متن کاملOn the Navarro-willems Conjecture for Blocks of Finite Groups
Let G be a finite group. For a prime p and a p-block B of G, we denote by Irr(B) the set of complex irreducible characters of G that belong to B. It was conjectured by Navarro and Willems [NW] that if for blocks Bp and Bq of G at different primes p, q we have an equality Irr(Bp) = Irr(Bq) then |Irr(Bp)| = 1. But then the first author of the present article found that the extension group 6.A7 of...
متن کاملSimple groups of finite
The Algebraicity Conjecture treats model-theoretic foundations of algebraic group theory. It states that any simple group of finite Morley rank is an algebraic group over an algebraically closed field. In the mid-1990s a view was consolidated that this project falls into four cases of different flavour: even type, mixed type, odd type, and degenerate type. This book contains a proof of the conj...
متن کاملOn finite simple groups and Kneser graphs
For a finite group G let (G) be the (simple) graph defined on the elements of G with an edge between two (distinct) vertices if and only if they generate G. The chromatic number of (G) is considered for various non-solvable groups G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2019
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927872.2019.1612424